منابع مشابه
On the Monotone Upper Bound Problem
The Monotone Upper Bound Problem asks for the maximal number M(d, n) of vertices on a strictly-increasing edge-path on a simple d-polytope with n facets. More specifically, it asks whether the upper bound M(d, n) ≤ Mubt(d, n) provided by McMullen’s (1970) Upper Bound Theorem is tight, where Mubt(d, n) is the number of vertices of a dual-to-cyclic d-polytope with n facets. It was recently shown ...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملAn upper bound on the k-modem illumination problem
A variation on the classical polygon illumination problem was introduced in [Aichholzer et. al. EuroCG’09]. In this variant light sources are replaced by wireless devices called k-modems, which can penetrate a fixed number k, of “walls”. A point in the interior of a polygon is “illuminated” by a k-modem if the line segment joining them intersects at most k edges of the polygon. It is easy to co...
متن کاملImproved Monotone Circuit Depth Upper Bound for Directed Graph Reachability
We prove that the directed graph reachability problem (transitive closure) can be solved by monotone fan-in 2 boolean circuits of depth (1/2+o(1))(log n)^2, where n is the number of nodes. This improves the previous known upper bound (1+o(1))(log n)^2. The proof is non-constructive, but we give a constructive proof of the upper bound (7/8+o(1))(log n)^2.
متن کاملAn Upper Bound in Goldbach's Problem
It is clear that the number of distinct representations of a number n as the sum of two primes is at most the number of primes in the interval [n/2, n-2]. We show that 210 is the largest value of n for which this upper bound is attained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Experimental Mathematics
سال: 2004
ISSN: 1058-6458,1944-950X
DOI: 10.1080/10586458.2004.10504519